/*
 * Copyright 2011 Fabian Wenzelmann
 * 
 * This file is part of Recognition-Procedures-for-Boolean-Functions.
 * 
 * Recognition-Procedures-for-Boolean-Functions is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 3 of the License, or
 * (at your option) any later version.
 * 
 * Recognition-Procedures-for-Boolean-Functions is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 * 
 * You should have received a copy of the GNU General Public License
 * along with Recognition-Procedures-for-Boolean-Functions.  If not, see <http://www.gnu.org/licenses/>.
 */

package de.wenzelmf.booleanFunction.lpb.util;

import de.wenzelmf.booleanFunction.dnf.ClauseFactory;
import de.wenzelmf.booleanFunction.dnf.DNFFactory;
import de.wenzelmf.booleanFunction.dnf.HashDNFFactory;
import de.wenzelmf.booleanFunction.dnf.MapClauseFactory;
import de.wenzelmf.booleanFunction.lpb.combinatorial.occurrencePattern.OccurrencePatternFactory;
import de.wenzelmf.booleanFunction.lpb.combinatorial.occurrencePattern.TreeMapPatternFactory;

/**
 * Contains some constants useful when you work with this package.
 * 
 * Defines for example default factories for Clause and DNF objects.
 * 
 * @author Fabian Wenzelmann
 * @version 1.0
 *
 */
public interface LPBCombinatorialConstants
{
	/**
	 * The default clause factory that is used to create new clauses, currently of type {@link MapClauseFactory}.
	 */
	public static ClauseFactory defaultClauseFactory = new MapClauseFactory();
	
	/**
	 * The default factory that is used to create new DNFs, currently of type {@link HashDNFFactory}.
	 */
	public static DNFFactory defaultDNFFactory = new HashDNFFactory();
	
	/**
	 * The default factory that is used to create new occurrence patterns, currently of type {@link TreeMapPatternFactory}.
	 */
	public static OccurrencePatternFactory defaultOPFactory = new TreeMapPatternFactory();
	
	/**
	 * The factor the size of DNFs, Clauses etc., that are based on HashMaps or HashSets,
	 * is multiplied with to create a HashTable with a size that is big enough to carry
	 * enough elements without rehashing.
	 */
	public static final float HASH_SIZE_FACTOR = 2.0F;
}
